Simultaneous block diagonalization of matrices of finite order

نویسندگان

چکیده

Abstract It is well known that a set of non-defect matrices can be simultaneously diagonalized if and only the commute. In case non-commuting matrices, best achieved simultaneous block diagonalization. Here we give an efficient algorithm to explicitly compute transfer matrix which realizes diagonalization unitary whose decomposition in irreducible blocks (common invariant subspaces) from elsewhere. Our main motivation lies particle physics, where resulting must order unequivocally determine action outer automorphisms such as parity, charge conjugation, or time reversal on spectrum.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Simultaneous Block-Diagonalization of Cyclic Commuting Matrices

We study simultaneous block-diagonalization of cyclic d-tuples of commuting matrices. Some application to ideal projectors are also presented. In particular we extend Hans Stetter’s theorem characterizing Lagrange projectors. 1 Introduction Let V be a …nite-dimensional space over complex …eld C and let L := (L1; :::; Ld) be a d-tuple of pairwise commuting operators on V . Every polynomial p(x1;...

متن کامل

Algorithm for Error-Controlled Simultaneous Block-Diagonalization of Matrices

An algorithm is given for the problem of finding the finest simultaneous block-diagonalization of a given set of square matrices. This problem has been studied independently in the area of semidefinite programming and independent component analysis. The proposed algorithm considers the commutant algebra of the matrix ∗-algebra generated by the given matrices. It is simpler than other existing m...

متن کامل

Block Diagonalization of Nearly Diagonal Matrices

In this paper we study the effect of block diagonalization of a nearly diagonal matrix by iterating the related Riccati equations. We show that the iteration is fast, if a matrix is diagonally dominant or scaled diagonally dominant and the block partition follows an appropriately defined spectral gap. We also show that both kinds of diagonal dominance are not destroyed after the block diagonali...

متن کامل

Fast block diagonalization of k-tridiagonal matrices

In the present paper, we give a fast algorithm for block diagonalization of k-tridiagonal matrices. The block diagonalization provides us with some useful results: e.g., another derivation of a very recent result on generalized k-Fibonacci numbers in [M.E.A. El-Mikkawy, T. Sogabe, A new family of k-Fibonacci numbers, Appl. Math. Comput. 215 (2010) 4456– 4461]; efficient (symbolic) algorithm for...

متن کامل

Synchronization of dynamical hypernetworks: dimensionality reduction through simultaneous block-diagonalization of matrices.

We present a general framework to study stability of the synchronous solution for a hypernetwork of coupled dynamical systems. We are able to reduce the dimensionality of the problem by using simultaneous block diagonalization of matrices. We obtain necessary and sufficient conditions for stability of the synchronous solution in terms of a set of lower-dimensional problems and test the predicti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics A

سال: 2021

ISSN: ['1751-8113', '1751-8121']

DOI: https://doi.org/10.1088/1751-8121/abd979